Additive Number Theory via Approximation by Regular Languages
نویسندگان
چکیده
منابع مشابه
Strongly Regular Grammars and Regular Approximation of Context-Free Languages
We consider algorithms for approximating context–free grammars by regular grammars, making use of Chomsky’s characterization of non–self–embedding grammars as generating regular languages and a transformation by Mohri and Nederhof on sets of mutually recursive nonterminals. We give an exposition of strongly regular grammars and this transformation, and use it as a subprocedure to obtain tighter...
متن کاملAdditive Functions with Respect to Numeration Systems on Regular Languages
Additive numeration systems and the corresponding additive arithmetic functions have been studied from various points of view since the seminal papers of H. Delange [4, 5], where such functions were investigated for the usual q-adic numeration system. Later more exotic systems of numeration, such as general linear numeration systems [13, 14], especially such systems defined by linear recurring ...
متن کاملNumber Theory and Formal Languages
I survey some of the connections between formal languages and number theory. Topics discussed include applications of representation in base k, representation by sums of Fibonacci numbers, automatic sequences, transcendence in nite characteristic , automaticreal numbers, xed points of homomorphisms, automaticity, and k-regular sequences.
متن کاملLearning Regular Languages via Alternating Automata
Nearly all algorithms for learning an unknown regular language, in particular the popular L∗ algorithm, yield deterministic finite automata. It was recently shown that the ideas of L∗ can be extended to yield non-deterministic automata, and that the respective learning algorithm, NL∗, outperforms L∗ on randomly generated regular expressions. We conjectured that this is due to the existential na...
متن کاملA theory of regular MSC languages
Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early design stages in domains such as telecommunication software. It is fruitful to have mechanisms for specifying and reasoning about collections of MSCs so that errors can be detected even at the requirements level. We propose, accordingly, a notion of regularity for collec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2020
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054120410014